Bounds on the deviation of discrete-time Markov chains from their mean-field model
نویسندگان
چکیده
We consider a generic mean-field scenario, in which a sequence of population models, described by discretetime Markov chains (DTMCs), converges to a deterministic limit in discrete time. Under the assumption that the limit has a globally attracting equilibrium, the steady states of the sequence of DTMC models converge to the point-mass distribution concentrated on this equilibrium. In this paper we provide explicit bounds in probability for the convergence of such steady states, combining stochastic bounds on the local error with control-theoretic tools used in the stability analysis of perturbed dynamical systems to bound the global accumulation of error. We also adapt this method to compute bounds on the transient dynamics. The approach is illustrated by a wireless sensor network example.
منابع مشابه
A Model For The Residence Time Distribution and Holdup Measurement in a Two Impinging Streams Cyclone Reactor/Contactor in Solid-Liquid Systems
In this paper a two impinging streams cyclone contacting system suitable for handling of solid-liquid systems has been studied. Certain pertinent parameters such as: solid holdup, mean residence time and Residence Time Distribution (RTD) of solid particles have been investigated. A stochastic model based on Markov chains processes has been applied which describe the behavior of solid partic...
متن کاملTime Delay and Data Dropout Compensation in Networked Control Systems Using Extended Kalman Filter
In networked control systems, time delay and data dropout can degrade the performance of the control system and even destabilize the system. In the present paper, the Extended Kalman filter is employed to compensate the effects of time delay and data dropout in feedforward and feedback paths of networked control systems. In the proposed method, the extended Kalman filter is used as an observer ...
متن کاملFinancial Risk Modeling with Markova Chain
Investors use different approaches to select optimal portfolio. so, Optimal investment choices according to return can be interpreted in different models. The traditional approach to allocate portfolio selection called a mean - variance explains. Another approach is Markov chain. Markov chain is a random process without memory. This means that the conditional probability distribution of the nex...
متن کاملSample Path Large Deviations for a Class of Markov Chains Related to Disordered Mean Field Models
We prove a large deviation principle on path space for a class of discrete time Markov processes whose state space is the intersection of a regular domain Λ ⊂ R with some lattice of spacing ǫ. Transitions from x to y are allowed if ǫ−1(x−y) ∈ ∆ for some fixed set of vectors ∆. The transition probabilities pǫ(t, x, y), which themselves depend on ǫ, are allowed to depend on the starting point x a...
متن کاملStochastic bounds for a single server queue with general retrial times
We propose to use a mathematical method based on stochastic comparisons of Markov chains in order to derive performance indice bounds. The main goal of this paper is to investigate various monotonicity properties of a single server retrial queue with first-come-first-served (FCFS) orbit and general retrial times using the stochastic ordering techniques.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Perform. Eval.
دوره 70 شماره
صفحات -
تاریخ انتشار 2013